A pragmatic approach to answering CQs over fuzzy DL-Lite-ontologies - introducing FLite
نویسندگان
چکیده
Fuzzy Description Logics (FDLs) generalize crisp ones by providing membership degree semantics. To offer efficient query answering for FDLs it is desirable to extend the rewriting-based approach for DL-Lite to its fuzzy variants. For answering conjunctive queries over fuzzy DL-LiteR ontologies we present an approach, that employs the crisp rewriting as a black-box procedure and treats the degrees in a second rewriting step. This pragmatic approach yields a sound procedure for the Gödel based fuzzy semantics, which we have implemented in the FLite reasoner that employs the Ontop system. A first evaluation of FLite suggests that one pays only a linear overhead for fuzzy queries.
منابع مشابه
Towards Temporal Fuzzy Query Answering on Stream-based Data
For reasoning over streams of data ontology-based data access is a common approach. The method for answering conjunctive queries (CQs) over DL-Lite ontologies in this setting is by rewritings of the query and evaluation of the resulting query by a data base engine. For streambased applications the classical expressivity of DL-Lite lacks means to handle fuzzy and temporal information. In this pa...
متن کاملQueries with negation and inequalities over lightweight ontologies
While the problem of answering positive existential queries, in particular, conjunctive queries (CQs) and unions of CQs, over description logic ontologies has been studied extensively, there have been few attempts to analyse queries with negated atoms. Our aim is to sharpen the complexity landscape of the problem of answering CQs with negation and inequalities in lightweight description logics ...
متن کاملAn Update on Query Answering with Restricted Forms of Negation
One of the most prominent applications of description logic ontologies is their use for accessing data. In this setting, ontologies provide an abstract conceptual layer of the data schema, and queries over the ontology are then used to access the data. In this paper we focus on extensions of conjunctive queries (CQs) and unions of conjunctive queries (UCQs) with restricted forms of negations su...
متن کاملModel Theory and Calculus for the Description Logic Dl-litef a Dissertation Submitted to the Faculty of Computer Science of the Free University of Bozen-bolzano for the Degree of Master of Science
The idea of using ontologies as a conceptual view over data repositories is becoming more and more popular. In practice, ontologies mediate between the repositories and a user [Len02], which allows the user to query the repositories by posing queries to the ontologies. Since data in the repositories is typically of a very large volume (much larger than the ontology itself), query answering shou...
متن کاملEmploying DL-LiteR-Reasoners for Fuzzy Query Answering
Fuzzy Description Logics generalize crisp ones by providing membership degree semantics for concepts and roles by fuzzy sets. Recently, answering of conjunctive queries has been investigated and implemented in optimized reasoner systems based on the rewriting approach for crisp DLs. In this paper we investigate how to employ such existing implementations for crisp query answering in DL-LiteR ov...
متن کامل